Fast and robust semi-local stereo matching using possibility distributions
نویسندگان
چکیده
منابع مشابه
Fast and robust semi-local stereo matching using possibility distributions
Global stereo matching methods aim to reduce the sensibility of stereo correspondence to ambiguities caused by occlusions, poor local texture or fluctuation of illumination. However, when facing the problem of real-time stereo matching, as in robotic vision, local algorithms are known to be the best. In this paper, we propose a semi-local stereo matching algorithm (SLSM algorithm); an area-base...
متن کاملLocal Stereo Matching Using Adaptive Local Segmentation
We propose a new dense local stereo matching framework for gray-level images based on an adaptive local segmentation using a dynamic threshold. We define a new validity domain of the fronto-parallel assumption based on the local intensity variations in the 4-neighborhood of the matching pixel. The preprocessing step smoothes low textured areas and sharpens texture edges, whereas the postprocess...
متن کاملFast and Robust Stereo Matching Algorithms for Mining Automation
NOTICE: this is the author’s version of a work that was accepted for publication in Digital Signal Processing. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive vers...
متن کاملFast Non-local Stereo Matching based on Hierarchical Disparity Prediction
Stereo matching is the key step in estimating depth from two or more images. Recently, some tree-based non-local stereo matching methods [22, 12] have been proposed, which achieved state-of-the-art performance. The algorithms employed some tree-structures to aggregate cost and thus improved the performance and reduced the coputation load of the stereo matching. However, the computational comple...
متن کاملA Fast Stereo Matching Method
Stereo matching is important in the area of computer vision and photogrammetry. This paper presents a fast stereo matching algorithm which produces a dense disparity map by using a pyramid structure, fast correlation and dynamic programming techniques. Fast correlation is achieved by using the box filtering technique which is invariant to the size of the correlation window. The disparity for ea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Vision and Robotics
سال: 2011
ISSN: 1752-9131,1752-914X
DOI: 10.1504/ijcvr.2011.042841